Is it possible to unify sequential programs?
نویسندگان
چکیده
We introduce a first-order model of imperative sequential programs and set up formally the unification problem in this model: given a pair of programs π1 and π2 find a pair of substitutions (θ1, θ2) such that the instances π1θ1 and π2θ2 of these programs are equivalent, i.e. compute the same function. Since functional equivalence of programs is undecidable, we choose its decidable approximation — a strong equivalence, — which is well-known in theory of program schemata. Our main result is a polynomial time unification algorithm for sequential programs w.r.t. strong equivalence of programs.
منابع مشابه
How DoesStrawson Unify Epistemology, Ontology and Logic
Strawson’s conception of analysis as a ‘connective linguistic analysis’ makes it possible for him to achieve an indefinitely large range of ideas or concepts among them are certain numbers of fundamental, general and pervasive concepts or concept-types which not only are pre-theoretical or ahistorical, but also together constitute a structural framework only within whichlogic, ontology and epis...
متن کاملPerformance, Carcass Characteristics and Immune Responses of Broiler Chickens Subjected to Sequential or Wet Feeding Programs Subsequent to Early Meal Feeding Regime
The current study was conducted to evaluate effects of sequential or wet feeding programs subsequent to and early meal feeding regime on performance, carcass characteristics and humoral immunity in broiler chicks. 192 Ross 308 chicks (seven-day old) were allocated to four treatments at four replicates (12 chicks per plot) based on a Completely Randomized Design. Treatments were included: contro...
متن کاملExtending The Dimensions of Consistency : Spatial Consistency and Sequential Segments
The Unify system is exploring scalable approaches for designing distributed multicomputers that support a shared memory paradigm. To achieve massive scalability, unify employs highly eecient communication protocols to support new weak consistency sharing models. In particular , Unify introduces the notion of spatial consistency and a non-standard memory type called sequential segments. The comb...
متن کاملThe Full-decomposition of Sequential Machines with the Separate Realization of the Next-state and Output Functions
The decomposition theory of sequential machines aims to find answers to the following important practical problem: how to decompose a complex sequential machine into a number of simpler partial machines in order to: simplify the design, implementation and verification process; make it possible to process (to optimize, to implement, to test, ••. ) the separate partial machines al though it may b...
متن کاملBounded-Interference Sequentialization for Testing Concurrent Programs
Testing concurrent programs is a challenging problem: (1) the tester has to come up with a set of input values that may trigger a bug, and (2) even with a bug-triggering input value, there may be a large number of interleavings that need to be explored. This paper proposes an approach for testing concurrent programs that explores both input and interleaving spaces in a systematic way. It is bas...
متن کامل